A sequential elimination algorithm for computing bounds on the clique number of a graph
نویسندگان
چکیده
We consider the problem of determining the size of a maximum clique in a graph, also known as the clique number. Given any method that computes an upper bound on the clique number of a graph, we present a sequential elimination algorithm which is guaranteed to improve upon that upper bound. Computational experiments on DIMACS instances show that, on average, this algorithm can reduce the gap between the upper bound and the clique number by about 60%. We also show how to use this sequential elimination algorithm to improve the computation of lower bounds on the clique number of a graph.
منابع مشابه
Computing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers
The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملOn computing the general Narumi-Katayama index of some graphs
The Narumi-Katayama index was the first topological index defined by the product of some graph theoretical quantities. Let $G$ be a simple graph with vertex set $V = {v_1,ldots, v_n }$ and $d(v)$ be the degree of vertex $v$ in the graph $G$. The Narumi-Katayama index is defined as $NK(G) = prod_{vin V}d(v)$. In this paper, the Narumi-Katayama index is generalized using a $n$-ve...
متن کاملON THE SZEGED INDEX OF NON-COMMUTATIVE GRAPH OF GENERAL LINEAR GROUP
Let $G$ be a non-abelian group and let $Z(G)$ be the center of $G$. Associate with $G$ there is agraph $Gamma_G$ as follows: Take $Gsetminus Z(G)$ as vertices of$Gamma_G$ and joint two distinct vertices $x$ and $y$ whenever$yxneq yx$. $Gamma_G$ is called the non-commuting graph of $G$. In recent years many interesting works have been done in non-commutative graph of groups. Computing the clique...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Optimization
دوره 5 شماره
صفحات -
تاریخ انتشار 2008